منابع مشابه
Recognizing Humor Without Recognizing Meaning
We present a machine learning approach for classifying sentences as one-liner jokes or normal sentences. We use no deep analysis of the meaning to try to see if it is humorous, instead we rely on a combination of simple features to see if these are enough to detect humor. Features such as word overlap with other jokes, presence of words common in jokes, ambiguity and word overlap with common id...
متن کاملStructural basis for recognizing phosphoarginine and evolving residue-specific protein phosphatases in gram-positive bacteria.
Many cellular pathways are regulated by the competing activity of protein kinases and phosphatases. The recent identification of arginine phosphorylation as a protein modification in bacteria prompted us to analyze the molecular basis of targeting phospho-arginine. In this work, we characterize an annotated tyrosine phosphatase, YwlE, that counteracts the protein arginine kinase McsB. Strikingl...
متن کاملRecognizing Activities
The recognition of repetitive movements character istic of walking people galloping horses or ying birds is a routine function of the human visual system It has been demonstrated that humans can recognize such activity solely on the basis of motion information We demonstrate a general computational method for recog nizing such movements in real image sequences using what is essentially template...
متن کاملRecognizing Expertise
A difficult issue with understanding face-to-face interactions is the lack of context information. Badge-like wearable sensors, for instance, can now tell us who talks to whom, but the context of these interactions (work? social?) likely trumps any content or conversational dynamics information. In this paper we detail a study where we have automatic annotations of work context information. We ...
متن کاملRecognizing Recursive
Recursive circulant graphs G(N; d) have been introduced in 1994 by Park and Chwa [PC94] as a new topology for interconnection networks. Recursive circulant graphs G(N; d) are circulant graphs with N nodes and with jumps of powers of d. A subfamily of recursive circulant graphs (more precisely, G(2; 4)) is of same order and degree than the hypercube of dimension k, with sometimes better paramete...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature Immunology
سال: 2014
ISSN: 1529-2908,1529-2916
DOI: 10.1038/ni.2910